package demo1;

import java.util.Arrays;

public class LeetCode611 {
    public int triangleNumber(int[] nums) {
        Arrays.sort(nums);
        int count = 0;
        int n = nums.length - 1;
        for(int i = n; i >=2; i--) {
            int left = 0, right = i - 1;
            while(left < right) {
                if(nums[left] + nums[right] > nums[i]) {
                    count += right - left;
                    right--;
                }else left++;
            }
        }
        return count;
    }
}
